On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control
نویسندگان
چکیده
We construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski [5]. However, instead of relying on nested CPS translations, these operators are directly interpreted in linear logic extended with subexponentials (i.e., multiple pairs of ! and ?). We construct an independent proof theory for a fragment of this logic based on the principle of focusing. It is then shown that the new constraints placed on the permutation of cuts correspond to multiple levels of delimited control.
منابع مشابه
On the Curry-Howard Interpretation of a Fragment of Classical Linear Logic with Subexponentials
We construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski [6]. However, instead of relying on nested CPS translations, these operators give directly a Curry-Howard interpretation of a fragment of linear logic extended with subexponentials, i.e., multiple pairs of ! and ?. We show how the fundamental problem of delimited...
متن کاملExpressing Additives Using Multiplicatives and Subexponentials
Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that a classical propositional multiplicative subexponential logic (MSEL) with one unrestricted and two linear subexponentials can en...
متن کاملUndecidability of Multiplicative Subexponential Logic
Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that classical propositional multiplicative linear logic extended with one unrestricted and two incomparable linear subexponentials c...
متن کاملSpecifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, it is possible to match the structural restrictions specified in the encoded logic with the use of linear logic connectives. However, some systems that impose more complicated structural restrictions on its sequents cannot...
متن کاملFocusing Strategies in the Sequent Calculus of Synthetic Connectives
It is well-known that focusing striates a sequent derivation into phases of like polarity where each phase can be seen as inferring a synthetic connective. We present a sequent calculus of synthetic connectives based on neutral proof patterns, which are a syntactic normal form for such connectives. Different focusing strategies arise from different polarisations and arrangements of synthetic in...
متن کامل